Random Generation of Dags for Graph Drawing

Drawing Directed Acyclic Graphs: An Experimental Study

In this paper we consider the class of directed acyclic graphs (DAGs), and present the results of an experimental study on four drawing algorithms speciically developed for DAGs. Our study is conducted on two large test suites of DAGs and yields more than 30 charts comparing the performance of the drawing algorithms with respect to several quality measures, including area, crossings, bends, and...

Synthetic Loads Analysis of Directed Acyclic Graphs for Scheduling Tasks

Graphs are structures used in different areas of scientific research, for the ease they have to represent different models of real life. There is a great variety of algorithms that build graphs with very dissimilar characteristics and types that model the relationships between the objects of the problem to solve. To model the relationships, characteristics such as depth, width and density of th...

DAGmaps and ε-Visibility Representations for DAGs: Algorithms and Characterizations

DAGmaps are space filling visualizations of DAGs that generalize treemaps. Deciding whether or not a DAG admits a DAGmap is NPcomplete. Although any layered planar DAG admits a one-dimensional DAGmap there was no complete characterization of the class of DAGs that admit a one-dimensional DAGmap. In this paper we prove that a DAG admits a one-dimensional DAGmap if and only if it admits a directe...

Recognizing Leveled-Planar Dags in Linear Time

Adocs: a Drawing System for Generic Combinatorial Structures

Existing graph drawing systems imply the use of speciic algorithms for each kind of data structures. This paper provide a description of the Adocs program. The program is based on a generic description of the structures, and thus allows to draw structures of an innnite number of classes. It can be used in order to produce graphical output for Gaaa, an uniform random generator of combinatorial s...